/*
 * @(#)SubArray.java	1.0 Mar 7, 2008
 *
 *	The MIT License
 *
 *	Copyright (c) 2008 Malachi de AElfweald <malachid@gmail.com>
 *
 *	Permission is hereby granted, free of charge, to any person obtaining a copy
 *	of this software and associated documentation files (the "Software"), to deal
 *	in the Software without restriction, including without limitation the rights
 *	to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 *	copies of the Software, and to permit persons to whom the Software is
 *	furnished to do so, subject to the following conditions:
 *
 *	The above copyright notice and this permission notice shall be included in
 *	all copies or substantial portions of the Software.
 *
 *	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 *	IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 *	FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 *	AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 *	LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 *	OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 *	THE SOFTWARE.
 */
package org.eoti.util;

import java.util.*;

public class SubArray<T>
implements Iterable<T>, Iterator<T>
{
	protected T[] arr;
	protected int startInclusive;
	protected int endInclusive;
	protected int currentPos;

	public SubArray(int startInclusive, int endInclusive, SubArray<T> arr)
	{
		this(startInclusive, endInclusive, arr.arr);
	}

	public SubArray(int startInclusive, SubArray<T> arr)
	{
		this(startInclusive, arr.arr);
	}

	public SubArray(int startInclusive, int endInclusive, T ... arr)
	{
		this.startInclusive = startInclusive;
		this.endInclusive = endInclusive;
		this.arr = arr;
		this.currentPos = startInclusive;
	}

	public SubArray(int startInclusive, T ... arr)
	{
		this(startInclusive, arr.length-1, arr);
	}

	public int size(){return arr.length;}

	public Iterator<T> iterator()
	{
		return this;
	}

	public boolean hasNext()
	{
		return (currentPos <= endInclusive);
	}

	public T next()
	{
		return arr[currentPos++];
	}

	public void remove()
	{
		throw new UnsupportedOperationException();
	}
}